Gradual Learning and Gradient Phonotactics
نویسنده
چکیده
Gradual learning as gradual adjustment of constraint values (Rosenblatt 1962, Boersma 1998) automatically yields weighting values that can be used in an account of gradient phonotactics, if the grammar is formulated in terms of Harmonic Grammar (HG; Legendre, Smolensky and Miyata 1990). I propose a new metric for gradient acceptability in HG, and show how a complex case of gradient phonotactics, the Muna restriction against sequences of homorganic consonants (Coetzee and Pater 2007) can be analyzed in these terms.
منابع مشابه
A Maximum Entropy Model of Phonotactics and Phonotactic Learning
The study of phonotactics (e.g., the ability of English speakers to distinguish possible words like blick from impossible words like *bnick) is a central topic in phonology. We propose a theory of phonotactic grammars and a learning algorithm that constructs such grammars from positive evidence. Our grammars consist of constraints that are assigned numerical weights according to the principle o...
متن کاملA Maximum Entropy Model of Phonotactics and
The study of phonotactics (e.g., the ability of English speakers to distinguish possible words like blick from impossible words like *bnick) is a central topic in phonology. We propose a theory of phonotactic grammars and a learning algorithm that constructs such grammars from positive evidence. Our grammars consist of constraints that are assigned numerical weights according to the principle o...
متن کاملComparative Phonotactics
1 Two kinds of phonotactics I contrast the notions of “absolute phonotactics” and “comparative phonotactics.” Absolute phonotactics is the study of well-formedness in phonology. The topic has a long history, but was laid out with particular cogency by Chomsky and Halle (1965), who noted that speakers have phonotactic judgments even of words they have never heard before; thus blick [blɪk] is non...
متن کاملEmpirical Tests of the Gradual Learning Algorithm
The Gradual Learning Algorithm (Boersma 1997) is a constraint-ranking algorithm for learning optimality-theoretic grammars. The purpose of this article is to assess the capabilities of the Gradual Learning Algorithm, particularly in comparison with the Constraint Demotion algorithm of Tesar and Smolensky (1993, 1996, 1998,2000), which initiated the learnability research program for Optimality T...
متن کاملGradual Change of Pulse Parameters as a New Strategy for Synthesis of Functionally Graded Ni-Cr Coatings
Synthesis of functionally gradient coating was the main goal of researches to cover some deficiencies of metallic coatings. In this study, a new strategy for generating functionally gradient coatings of nickel-chromium on a carbon steel substrate using pulse electrodeposition has been presented. The gradual changes of the duty cycle and pulse frequency were used to generate the functionally gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007